Time-Varying Queues

نویسنده

  • Ward Whitt
چکیده

Service systems abound with queues, but the most natural direct models are often timevarying queues, which require nonstandard analysis methods beyond stochastic textbooks. This paper surveys the literature on time-varying queues. Most of the literature concerns manyserver queues, which arise in large-scale service systems, such as in customer contact centers and hospital emergency departments, but there also has been some work on single-server queues with time-varying arrivals, which arise in some settings, such as airplanes coming to land at an airport and medical staff waiting for the availability of special operating rooms in a hospital. The understanding of many-server queues and single-server queues is enhanced by heavy-traffic limits, which have recently been extended to time-varying models as well as stationary models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment

To describe the congestion in large-scale service systems, we introduce and analyze a non-Markovian open network of many-server fluid queues with customer abandonment, proportional routing and time-varying model elements. A proportion of the fluid completing service at each queue is routed immediately to each other queue, while the fluid not routed to other queues leaves the network. The fluid ...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

Algorithms for Time-Varying Networks of Many-Server Fluid Queues

Motivated by large-scale service systems with network structure and non-exponential customer abandonment, in a previous paper we introduced a non-Markovian time-varying open network of many-server fluid queues with customer abandonment from each queue and timevarying proportional routing among the queues, and showed how performance functions can be determined. The deterministic fluid model serv...

متن کامل

Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations

In this paper, we consider time-varying multi-server queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multi-server queues even if the number of servers is large. To address that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017